0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.14	% Command    : run_E %s %d THM
0.13/0.35	% Computer : n024.cluster.edu
0.13/0.35	% Model    : x86_64 x86_64
0.13/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory   : 8042.1875MB
0.13/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 960
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Aug  9 02:11:37 EDT 2022
0.13/0.35	% CPUTime    : 
0.20/0.49	Running higher-order on 8 cores theorem proving
0.20/0.49	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.49	# Version: 3.0pre003-ho
0.20/0.51	# Preprocessing class: HSMSSMSSMLLNHSN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.51	# Starting new_ho_10_cnf2 with 600s (5) cores
0.20/0.51	# Starting post_as_ho3 with 120s (1) cores
0.20/0.51	# Starting new_ho_12 with 120s (1) cores
0.20/0.51	# Starting new_bool_2 with 120s (1) cores
0.20/0.51	# new_ho_10_cnf2 with pid 7766 completed with status 0
0.20/0.51	# Result found by new_ho_10_cnf2
0.20/0.51	# Preprocessing class: HSMSSMSSMLLNHSN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.51	# Starting new_ho_10_cnf2 with 600s (5) cores
0.20/0.51	# No SInE strategy applied
0.20/0.51	# Search class: HGHNS-FFMS21-SHSSMFNN
0.20/0.51	# partial match(2): HGUNS-FFMF21-SHSSMFNN
0.20/0.51	# Scheduled 6 strats onto 5 cores with 600 seconds (600 total)
0.20/0.51	# Starting new_ho_10 with 325s (1) cores
0.20/0.51	# Starting new_ho_10_cnf2 with 61s (1) cores
0.20/0.51	# Starting ho_unfolding_6 with 55s (1) cores
0.20/0.51	# Starting sh4l with 55s (1) cores
0.20/0.51	# Starting ehoh_best_nonlift_rwall with 55s (1) cores
0.20/0.51	# ho_unfolding_6 with pid 7775 completed with status 0
0.20/0.51	# Result found by ho_unfolding_6
0.20/0.51	# Preprocessing class: HSMSSMSSMLLNHSN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.51	# Starting new_ho_10_cnf2 with 600s (5) cores
0.20/0.51	# No SInE strategy applied
0.20/0.51	# Search class: HGHNS-FFMS21-SHSSMFNN
0.20/0.51	# partial match(2): HGUNS-FFMF21-SHSSMFNN
0.20/0.51	# Scheduled 6 strats onto 5 cores with 600 seconds (600 total)
0.20/0.51	# Starting new_ho_10 with 325s (1) cores
0.20/0.51	# Starting new_ho_10_cnf2 with 61s (1) cores
0.20/0.51	# Starting ho_unfolding_6 with 55s (1) cores
0.20/0.51	# Preprocessing time       : 0.003 s
0.20/0.51	
0.20/0.51	# Proof found!
0.20/0.51	# SZS status Theorem
0.20/0.51	# SZS output start CNFRefutation
0.20/0.51	thf(decl_22, type, mrel: mworld > mworld > $o).
0.20/0.51	thf(decl_23, type, mactual: mworld).
0.20/0.51	thf(decl_24, type, mlocal: (mworld > $o) > $o).
0.20/0.51	thf(decl_25, type, mnot: (mworld > $o) > mworld > $o).
0.20/0.51	thf(decl_26, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.51	thf(decl_27, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.51	thf(decl_28, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.51	thf(decl_29, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.51	thf(decl_30, type, mbox: (mworld > $o) > mworld > $o).
0.20/0.51	thf(decl_31, type, mdia: (mworld > $o) > mworld > $o).
0.20/0.51	thf(decl_32, type, eiw_di: $i > mworld > $o).
0.20/0.51	thf(decl_33, type, mforall_di: ($i > mworld > $o) > mworld > $o).
0.20/0.51	thf(decl_34, type, mexists_di: ($i > mworld > $o) > mworld > $o).
0.20/0.51	thf(decl_35, type, empty_set: $i).
0.20/0.51	thf(decl_36, type, qmltpeq: $i > $i > mworld > $o).
0.20/0.51	thf(decl_37, type, equal_set: $i > $i > mworld > $o).
0.20/0.51	thf(decl_38, type, member: $i > $i > mworld > $o).
0.20/0.51	thf(decl_39, type, subset: $i > $i > mworld > $o).
0.20/0.51	thf(decl_40, type, singleton: $i > $i).
0.20/0.51	thf(decl_41, type, product: $i > $i).
0.20/0.51	thf(decl_42, type, unordered_pair: $i > $i > $i).
0.20/0.51	thf(decl_43, type, intersection: $i > $i > $i).
0.20/0.51	thf(decl_44, type, difference: $i > $i > $i).
0.20/0.51	thf(decl_45, type, sum: $i > $i).
0.20/0.51	thf(decl_46, type, union: $i > $i > $i).
0.20/0.51	thf(decl_47, type, power_set: $i > $i).
0.20/0.51	thf(decl_48, type, esk1_2: $i > $i > $i).
0.20/0.51	thf(decl_49, type, esk2_1: mworld > $i).
0.20/0.51	thf(decl_50, type, esk3_2: $i > $i > $i).
0.20/0.51	thf(decl_51, type, esk4_0: $i).
0.20/0.51	thf(decl_52, type, esk5_0: $i).
0.20/0.51	thf(decl_53, type, esk6_2: $i > $i > $i).
0.20/0.51	thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mlocal_def)).
0.20/0.51	thf(mand_def, axiom, ((mand)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)&(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mand_def)).
0.20/0.51	thf(mimplies_def, axiom, ((mimplies)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)=>(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mimplies_def)).
0.20/0.51	thf(mforall_di_def, axiom, ((mforall_di)=(^[X6:$i > mworld > $o, X3:mworld]:(![X7:$i]:(((eiw_di @ X7 @ X3)=>(X6 @ X7 @ X3)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mforall_di_def)).
0.20/0.51	thf(mequiv_def, axiom, ((mequiv)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)<=>(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mequiv_def)).
0.20/0.51	thf(thI02, conjecture, (mlocal @ (mforall_di @ (^[X39:$i]:(mforall_di @ (^[X40:$i]:(mimplies @ (mand @ (subset @ X39 @ X40) @ (subset @ X40 @ X39)) @ (equal_set @ X39 @ X40))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', thI02)).
0.20/0.51	thf(equal_set_0, axiom, (mlocal @ (mforall_di @ (^[X35:$i]:(mforall_di @ (^[X36:$i]:(mequiv @ (equal_set @ X35 @ X36) @ (mand @ (subset @ X35 @ X36) @ (subset @ X36 @ X35)))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', equal_set_0)).
0.20/0.51	thf(c_0_7, plain, ((mlocal)=(^[Z0:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])).
0.20/0.51	thf(c_0_8, plain, ((mand)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)&(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mand_def])).
0.20/0.51	thf(c_0_9, plain, ((mimplies)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies_def])).
0.20/0.51	thf(c_0_10, plain, ((mforall_di)=(^[Z0:$i > mworld > $o, Z1:mworld]:(![X7:$i]:(((eiw_di @ X7 @ Z1)=>(Z0 @ X7 @ Z1)))))), inference(fof_simplification,[status(thm)],[mforall_di_def])).
0.20/0.51	thf(c_0_11, plain, ((mequiv)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)<=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mequiv_def])).
0.20/0.51	thf(c_0_12, negated_conjecture, ~(![X118:$i]:(((eiw_di @ X118 @ mactual)=>![X117:$i]:(((eiw_di @ X117 @ mactual)=>(((subset @ X118 @ X117 @ mactual)&(subset @ X117 @ X118 @ mactual))=>(equal_set @ X118 @ X117 @ mactual))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thI02])]), c_0_7]), c_0_8]), c_0_9]), c_0_10])).
0.20/0.51	thf(c_0_13, plain, ![X112:$i]:(((eiw_di @ X112 @ mactual)=>![X111:$i]:(((eiw_di @ X111 @ mactual)=>((equal_set @ X112 @ X111 @ mactual)<=>((subset @ X112 @ X111 @ mactual)&(subset @ X111 @ X112 @ mactual))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[equal_set_0]), c_0_7]), c_0_8]), c_0_11]), c_0_10])).
0.20/0.51	thf(c_0_14, negated_conjecture, ((eiw_di @ esk4_0 @ mactual)&((eiw_di @ esk5_0 @ mactual)&(((subset @ esk4_0 @ esk5_0 @ mactual)&(subset @ esk5_0 @ esk4_0 @ mactual))&~(equal_set @ esk4_0 @ esk5_0 @ mactual)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])).
0.20/0.51	thf(c_0_15, plain, ![X202:$i, X203:$i]:(((((subset @ X202 @ X203 @ mactual)|~(equal_set @ X202 @ X203 @ mactual)|~(eiw_di @ X203 @ mactual)|~(eiw_di @ X202 @ mactual))&((subset @ X203 @ X202 @ mactual)|~(equal_set @ X202 @ X203 @ mactual)|~(eiw_di @ X203 @ mactual)|~(eiw_di @ X202 @ mactual)))&(~(subset @ X202 @ X203 @ mactual)|~(subset @ X203 @ X202 @ mactual)|(equal_set @ X202 @ X203 @ mactual)|~(eiw_di @ X203 @ mactual)|~(eiw_di @ X202 @ mactual)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])).
0.20/0.51	thf(c_0_16, negated_conjecture, ~((equal_set @ esk4_0 @ esk5_0 @ mactual)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.51	thf(c_0_17, plain, ![X9:$i, X7:$i]:(((equal_set @ X7 @ X9 @ mactual)|~((subset @ X7 @ X9 @ mactual))|~((subset @ X9 @ X7 @ mactual))|~((eiw_di @ X9 @ mactual))|~((eiw_di @ X7 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_15])).
0.20/0.51	thf(c_0_18, negated_conjecture, (subset @ esk5_0 @ esk4_0 @ mactual), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.51	thf(c_0_19, negated_conjecture, (subset @ esk4_0 @ esk5_0 @ mactual), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.51	thf(c_0_20, negated_conjecture, (eiw_di @ esk5_0 @ mactual), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.51	thf(c_0_21, negated_conjecture, (eiw_di @ esk4_0 @ mactual), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.51	thf(c_0_22, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), c_0_19]), c_0_20]), c_0_21])]), ['proof']).
0.20/0.51	# SZS output end CNFRefutation
0.20/0.51	# Parsed axioms                        : 73
0.20/0.51	# Removed by relevancy pruning/SinE    : 0
0.20/0.51	# Initial clauses                      : 88
0.20/0.51	# Removed in clause preprocessing      : 27
0.20/0.51	# Initial clauses in saturation        : 61
0.20/0.51	# Processed clauses                    : 14
0.20/0.51	# ...of these trivial                  : 0
0.20/0.51	# ...subsumed                          : 0
0.20/0.51	# ...remaining for further processing  : 14
0.20/0.51	# Other redundant clauses eliminated   : 0
0.20/0.51	# Clauses deleted for lack of memory   : 0
0.20/0.51	# Backward-subsumed                    : 0
0.20/0.51	# Backward-rewritten                   : 0
0.20/0.51	# Generated clauses                    : 9
0.20/0.51	# ...of the previous two non-redundant : 6
0.20/0.51	# ...aggressively subsumed             : 0
0.20/0.51	# Contextual simplify-reflections      : 0
0.20/0.51	# Paramodulations                      : 9
0.20/0.51	# Factorizations                       : 0
0.20/0.51	# NegExts                              : 0
0.20/0.51	# Equation resolutions                 : 0
0.20/0.51	# Propositional unsat checks           : 0
0.20/0.51	#    Propositional check models        : 0
0.20/0.51	#    Propositional check unsatisfiable : 0
0.20/0.51	#    Propositional clauses             : 0
0.20/0.51	#    Propositional clauses after purity: 0
0.20/0.51	#    Propositional unsat core size     : 0
0.20/0.51	#    Propositional preprocessing time  : 0.000
0.20/0.51	#    Propositional encoding time       : 0.000
0.20/0.51	#    Propositional solver time         : 0.000
0.20/0.51	#    Success case prop preproc time    : 0.000
0.20/0.51	#    Success case prop encoding time   : 0.000
0.20/0.51	#    Success case prop solver time     : 0.000
0.20/0.51	# Current number of processed clauses  : 14
0.20/0.51	#    Positive orientable unit clauses  : 6
0.20/0.51	#    Positive unorientable unit clauses: 0
0.20/0.51	#    Negative unit clauses             : 1
0.20/0.51	#    Non-unit-clauses                  : 7
0.20/0.51	# Current number of unprocessed clauses: 53
0.20/0.51	# ...number of literals in the above   : 247
0.20/0.51	# Current number of archived formulas  : 0
0.20/0.51	# Current number of archived clauses   : 0
0.20/0.51	# Clause-clause subsumption calls (NU) : 24
0.20/0.51	# Rec. Clause-clause subsumption calls : 4
0.20/0.51	# Non-unit clause-clause subsumptions  : 0
0.20/0.51	# Unit Clause-clause subsumption calls : 0
0.20/0.51	# Rewrite failures with RHS unbound    : 0
0.20/0.51	# BW rewrite match attempts            : 0
0.20/0.51	# BW rewrite match successes           : 0
0.20/0.51	# Condensation attempts                : 14
0.20/0.51	# Condensation successes               : 0
0.20/0.51	# Termbank termtop insertions          : 14018
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.011 s
0.20/0.51	# System time              : 0.005 s
0.20/0.51	# Total time               : 0.016 s
0.20/0.51	# Maximum resident set size: 2792 pages
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.026 s
0.20/0.51	# System time              : 0.015 s
0.20/0.51	# Total time               : 0.041 s
0.20/0.51	# Maximum resident set size: 1836 pages
0.20/0.51	EOF